Package edu.uky.ai.csp

Class MapColoring

java.lang.Object
edu.uky.ai.csp.kr.Problem
edu.uky.ai.csp.MapColoring
public class MapColoring
extends Problem
Models the problem of coloring a map so that no two adjacent regions have the same color. This problem assumes that graph is planar and thus can be colored with at most 4 colors.
Author:
Stephen G. Ware

  • Field Summary

    Fields inherited from class edu.uky.ai.csp.kr.Problem

    constraints, variables

  • Constructor Summary

    Constructors 
    Constructor Description
    MapColoring​(java.lang.String map)
    Constructs a new map coloring problem based on the adjacency list.

  • Method Summary

    Methods inherited from class edu.uky.ai.csp.kr.Problem

    addConstraint, addVariable, getDomain, toString

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • MapColoring

      public MapColoring​(java.lang.String map)
      Constructs a new map coloring problem based on the adjacency list.
      Parameters:
      map - a string adjacency list